Modified Hierarchical 3D-Torus Network
نویسندگان
چکیده
Three-dimensional (3D) wafer stacked implementation (WSI) has been proposed as a promising technology for massively parallel computers. A hierarchical 3D-torus (H3DT) network, which is a 3D-torus network of multiple basic modules in which the basic modules are 3D-mesh networks, has been proposed for efficient 3D-WSI. However, the restricted use of physical links between basic modules in the higher level networks reduces the dynamic communication performance of this network. A torus network has better dynamic communication performance than a mesh network. Therefore, we have modified the H3DT network by replacing the 3D-mesh modules by 3D-tori, calling it a Modified H3DT (MH3DT) network. This paper addresses the architectural details of the MH3DT network and explores aspects such as degree, diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the MH3DT network using two virtual channels and evaluate the network’s dynamic communication performance under the uniform traffic pattern, using the proposed routing algorithm. It is shown that the MH3DT network possesses several attractive features including small diameter, small cost, small average distance, better bisection width, and better dynamic communication performance. key words: MH3DT network, static network performance, wormhole routing, deadlock-free routing, dynamic communication performance
منابع مشابه
On Dynamic Communication Performance of a Hierarchical 3D-Mesh Network
A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules (BMs), in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication performance of a Hierarchical 3D-Mesh (H3DM) network using a deadlock-free routing algorithm with minimum number of virtual channels unde...
متن کاملRecursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers
ÐRecursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2 nodes. By making the best use of a recursively structured diagonal mesh (torus) connection, the RDT has a smaller diameter (e.g., it is 11 for 2 nodes) with a smaller number of links per node (i.e., 8 links per node) than those of the hypercube. A simple routing algorith...
متن کاملA hierarchical Convolutional Neural Network for Segmentation of Stroke Lesion in 3D Brain MRI
Introduction: Brain tumors such as glioma are among the most aggressive lesions, which result in a very short life expectancy in patients. Image segmentation is highly essential in medical image analysis with applications, particularly in clinical practices to treat brain tumors. Accurate segmentation of magnetic resonance data is crucial for diagnostic purposes, planning surgical treatments, a...
متن کاملA hierarchical Convolutional Neural Network for Segmentation of Stroke Lesion in 3D Brain MRI
Introduction: Brain tumors such as glioma are among the most aggressive lesions, which result in a very short life expectancy in patients. Image segmentation is highly essential in medical image analysis with applications, particularly in clinical practices to treat brain tumors. Accurate segmentation of magnetic resonance data is crucial for diagnostic purposes, planning surgical treatments, a...
متن کاملLink-Disjoint Broadcasting Algorithm in Wormhole-Routed 3D Petersen-Torus Networks
In a network, one-to-all broadcasting is the process of disseminating messages from a source node to all the nodes existing in the network through successive data transmissions between pairs of nodes. Broadcasting is the most primary communication process in a network. A 3D Petersen-Torus (3D PT) network has been proposed recently. the three-dimensionallymagnified Petersen-Torus topology, 3D PT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 88-D شماره
صفحات -
تاریخ انتشار 2005